Universal algorithms for generalized discrete matrix Bellman equations with symmetric Toeplitz matrix
نویسنده
چکیده
This paper presents two universal algorithms for generalized discrete matrix Bellman equations with symmetric Toeplitz matrix. The algorithms are semiring extensions of two well-known methods solving Toeplitz systems in the ordinary linear algebra.
منابع مشابه
On the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملFast Structured Matrix Computations: Tensor Rank and Cohn-Umans Method
We discuss a generalization of the Cohn–Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn–Umans method may be used for bilinear operations other than matrix multiplication, with algebras other than group algebras, and we relate it to Strassen’s tensor rank ...
متن کاملParallel Algorithms for the Solution of Toeplitz Systems of Linear Equations
In this paper we present two parallel algorithms to solve non-symmetric Toeplitz systems of linear equations. The first algorithm performs a modified QR factorization of the matrix by using the generalized Schur algorithm. The second one is based on the transformation of the Toeplitz matrix into a Cauchy-like matrix in order to reduce the communication cost. Both sequential methods have small c...
متن کاملUniversal algorithms for solving the matrix Bellman equations over semirings
This paper is a survey on universal algorithms for solving the matrix Bellman equations over semirings and especially tropical and idempotent semirings. However, original algorithms are also presented. Some applications and software implementations are discussed.
متن کاملLevinson-type extensions for non-Toeplitz systems - Signal Processing, IEEE Transactions on
We show that Levinson's basic principle for the solution of normal equations which are of Toeplitz form may he extended to the case where these equations do not possess this specific symmetry. The use of Levinson's principle allows us to obtain a compact ( 2 x 2 ) form to express a system of equations of arbitrary order. This compact form is the key expression in the development of recursive al...
متن کامل